Planar Packing of Diameter-Four Trees
نویسنده
چکیده
We prove that, for every two n-node non-star trees of diameter at most four, there exists an n-node planar graph containing them as edge-disjoint subgraphs.
منابع مشابه
The Planar Tree Packing Theorem
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and have to find a planar graph on n vertices that is the edge-disjoint union of T1 and T2. A clear exception that must be made is the star which cannot be packe...
متن کاملPlanar Packing of Binary Trees
In the graph packing problem we are given several graphs and have to map them into a single host graph G such that each edge of G is used at most once. Much research has been devoted to the packing of trees, especially to the case where the host graph must be planar. More formally, the problem is: Given any two trees T1 and T2 on n vertices, we want a simple planar graph G on n vertices such th...
متن کاملPacking Trees into Planar Graphs
1 I n t r o d u c t i o n We say that the graphs H 1 , . . . , Hk can be packed into a graph G if G contains subgraphs isomorphic to H 1 , . . . , Hk and pairwise edge disjoint. The problem of packing graphs has been widely studied, especially when G is a complete graph. For instance, it is known that two trees with n vertices none of them equal to a star can be packed into K~ [2]. The packing ...
متن کاملSimple Algorithms for Steiner Trees and Paths Packing Problems in Planar Graphs
In this paper we give a short survey on eecient algorithms for Steiner trees and paths packing problems in planar graphs. We particularly concentrate on recent results. The rst result is a linear-time algorithm for packing vertex-disjoint trees resp. paths within a planar graph, where the vertices to be connected lie on at most two diierent faces 26, 32]. This algorithm is based on a linear-tim...
متن کاملEgerváry Research Group on Combinatorial Optimization Packing Arborescences Packing Arborescences
In [7], Edmonds proved a fundamental theorem on packing arborescences that has become the base of several subsequent extensions. Recently, Japanese researchers found an unexpected further generalization which gave rise to many interesting questions about this subject [29], [20]. Another line of researches focused on covering intersecting families which generalizes Edmonds' theorems in a di eren...
متن کامل